Declarative Model Transformation Execution Planning
نویسندگان
چکیده
Declarative model transformation languages require that the underlying reasoning engine synthesises an execution plan that guarantees correctness while also providing reasonable performance. Optimization of these execution plans is a hard problem and for languages such as QVT Core, finding an optimal solution is still unsolved. By understanding how a brute force execution plan guarantees correctness, we can find an algorithm to construct the complete solution space of correct execution plans and from it find an optimal solution. In this paper we explore how the complete solution space of execution plans can be constructed, how data dependency analysis can be used to evaluate these plans for correctness and how their performance can be estimated. The results show that our performance estimates are correlated to the observed performance.
منابع مشابه
Towards a runtime model based on colored Petri-nets for the execution of model transformations
Existing model transformation languages, which range from purely imperative to fully declarative approaches, have the advantage of either explicitly providing statefulness and the ability to define control flow, or offering a raised level of abstraction through automatic rule ordering and application. Existing approaches trying to combine the strengths of both paradigms do so on the language le...
متن کاملLets’s Play the Token Game – Model Transformations Powered By Transformation Nets
Model-Driven Engineering (MDE) is a software engineering paradigm using abstract models to describe systems which are then systematically transformed to concrete implementations. Since model transformations are crucial for the success of MDE, several kinds of dedicated transformation languages have been proposed. Hybrid languages combine the statefulness and the ability to define control flow o...
متن کاملModel-based Execution through Reactive Planning for Autonomous Planetary Rovers
This paper reports on the design and implementation of a real-time executive for a mobile rover that uses a model-based, declarative approach. The control system is based on the Intelligent Distributed Execution Architecture (IDEA), an approach to planning and execution that provides a unified representational and computational framework for an autonomous agent. The basic hypothesis of IDEA is ...
متن کاملPractical Declarative Model Transformation with Tefkat
We present Tefkat, an implementation of a language designed speci cally for the transformation of MOF models using patterns and rules. The language adopts a declarative paradigm, wherein users may concern themselves solely with the relations between the models rather than needing to deal explicitly with issues such as order of rule execution and pattern searching/traversal of input models. In t...
متن کاملACTA UNIVERSITATIS APULENSIS No 18/2009 OPTIMIZING NON-FUNCTIONAL PROPERTIES OF A SERVICE COMPOSITION USING A DECLARATIVE MODEL-TO-MODEL TRANSFORMATION
Developing applications comprising service composition is a complex task. Service composition requires the knowledge of various process languages (e.g. WS-BPEL, XPDL, or WSFL) or the knowledge of languages like WS-CDL which focus more on messaging aspects. To choose the right language for the problem at hand requires a lot of research as different aspects of various languages need to be conside...
متن کامل